combinatorial problem中文是什么意思

發(fā)音:

中文翻譯
造句

組合問(wèn)題
組合最優(yōu)化問(wèn)題

problem n. 1.問(wèn)題，課題；疑難問(wèn)題；令人困惑的情況。 2.【 ...
combinatorial covering problem 組合復(fù)蓋問(wèn)題
combinatorial matching problem 組合匹配問(wèn)題
combinatorial optimization problem 組合最優(yōu)化問(wèn)題
combinatorial 組合的
combinatorial algorithm 組合算法
combinatorial analysis 組合分析
combinatorial association 組合聯(lián)合
combinatorial chemistry 組合化學(xué)
combinatorial circuit 組合電路
combinatorial closure 組合閉包
combinatorial completeness 組合完備性
combinatorial compression 組合壓縮
combinatorial construction 合并結(jié)構(gòu)
combinatorial dimension 組合維數(shù)
combinatorial dual 組合對(duì)偶
combinatorial embedding 組合嵌入
combinatorial explosion 組合爆炸; 組合激增
combinatorial genus 組合虧格
combinatorial geometry 組合幾何學(xué)
combinatorial groutheory 組合群倫
combinatorial immersion 組合浸入
combinatorial input 組合輸入
combinatorial insertion 合并中插
combinatorial logic 組合邏輯電路

"查查詞典"手機(jī)版

千萬(wàn)人都在用的超大詞匯詞典翻譯APP

例句與用法

This is a combinatorial problem in canonical form .
這是組合論中的典型問(wèn)題。
Inter - relations among collaborative discussion , meta - cognitive control and successful solution in combinatorial problem
合作討論和元認(rèn)知監(jiān)控與排列組合問(wèn)題的解決
Adleman , l . m . " molecular computation of solutions to combinatorial problems . " science 266 ( 5187 ) ( 11 nov 1994 ) : 1021 - 4
組合問(wèn)題的分子運(yùn)算解決方法. " 。期刊科學(xué)第266卷。第1024到1024頁(yè)。
This paper presents the mathematical model and the general algorithms of transforming combinatorial problem into state space search
本文提出了將組合問(wèn)題歸結(jié)為狀態(tài)空間搜索問(wèn)題的數(shù)學(xué)模型和通用算法。
Because the design of state space of the combinatorial problem is much easier than design of the searching algorithm , the present of the general searching algorithm is the apparent progress for the searching technology
因?yàn)榻M合問(wèn)題的狀態(tài)空間表示比原來(lái)的搜索求解容易的多，通用搜索算法的提出是搜索技術(shù)的一個(gè)明顯的進(jìn)步。
Supposed algorithm b is the concrete searching algorithm for the combinatorial problem p . the parameter of algorithm a corresponding to algorithm b is the algorithm that denotes the combinatorial problem p in the way of the state space
設(shè)b是求解組合問(wèn)題p的具體搜索算法，算法a對(duì)應(yīng)于算法b的參數(shù)就是用狀態(tài)空間表示組合問(wèn)題p的算法。
The program of state space to solve one combinatorial problem is made up of the general searching module and one module of material problem . the different material problems have different modules , but the general searching module does not vary with the problems
一個(gè)組合問(wèn)題的狀態(tài)空間求解程序由通用搜索模塊加上一個(gè)問(wèn)題描述模塊組成，不同問(wèn)題具有不同的問(wèn)題描述模塊，通用搜索模塊不隨問(wèn)題的改變而改變。
Problem c and problem d are also dual . they have a dual property that there are at least three " critical points " corresponding to an optimal straight - line in problem c and there are at least three " critical straight - lines " corre - sponding to an optimal point in problem d . from these properties , these four non - linear prob - lems could be transformed into combinatorial problems and could be solved by algorithms with polynomial - time iterations
問(wèn)題c和問(wèn)題d也是對(duì)偶問(wèn)題。問(wèn)題c和問(wèn)題d也有很好的對(duì)偶性質(zhì)：在問(wèn)題c中，對(duì)應(yīng)于一條最優(yōu)直線，至少存在三個(gè)“臨界點(diǎn)” ；在問(wèn)題d中，對(duì)應(yīng)于一個(gè)最優(yōu)點(diǎn)，至少存在三條“臨界直線” 。基于這種性質(zhì)，這四個(gè)非線性優(yōu)化問(wèn)題便轉(zhuǎn)化為組合問(wèn)題，從而得到迭代次數(shù)為多項(xiàng)式的算法。
The algorithm is based on the breadth - first search and optimized by ant algorithm . ants system is an artificial system based on the behavior of real ant colonies , which is often used to solve combinatorial problems , such as traveling salesman problem ( tsp ) . in ant colony system ( acs ) , a set of cooperating agents called ants cooperate to find good solutions to tsp
本算法基于寬度優(yōu)先并用螞蟻算法優(yōu)化，螞蟻算法是一種基于真實(shí)蟻群的人工智能系統(tǒng)，常用于解決組合優(yōu)化問(wèn)題，如旅行商問(wèn)題( tsp ) ，在螞蟻算法中一組螞蟻團(tuán)結(jié)合作，尋找tsp問(wèn)題的最優(yōu)解。
Until now , this type of combinatorial problems are usually solved by linear programming , interger programming , analytical methods , heuristic methods and so on . but these methods have many disadvantages such as . low searching efficiency , converging slowly , converging to local optimization solution easily and not converging
本文針對(duì)目前對(duì)接入網(wǎng)優(yōu)化存在著缺乏有效算法的現(xiàn)狀，確定了采用高效的啟發(fā)式搜索算法? ?遺傳算法作為優(yōu)化算法，著重解決了遺傳算子的設(shè)計(jì)和實(shí)現(xiàn)問(wèn)題，并對(duì)算法進(jìn)行了改進(jìn)，取得了很好的效果。

更多例句： 1 2

其他語(yǔ)種釋義

combinatorial problemとは意味：順列組み合わせ問(wèn)題

推薦英語(yǔ)閱讀

combinatorial problem的中文翻譯，combinatorial problem是什么意思，怎么用漢語(yǔ)翻譯combinatorial problem，combinatorial problem的中文意思，combinatorial problem的中文，combinatorial problem in Chinese，combinatorial problem的中文，combinatorial problem怎么讀，發(fā)音，例句，用法和解釋由查查在線詞典提供，版權(quán)所有違者必究。